Efficient and Forward-Secure Identity-Based Signcryption
نویسندگان
چکیده
Several signcryption schemes proposed in the literature are known to lack semantic security, and semantically secure signcryption schemes tend to be more computationally expensive. In fact, devising an efficient signcryption scheme providing both public verifiability and forward security was until now an open problem. In this paper, we show how a particular kind of signcryption scheme may become completely insecure when implemented with certain efficient instantiations of the Tate or Weil pairing. We also address the drawbacks of the secure schemes by proposing efficient, semantically and forward-secure signcryption schemes, in both transferable and non-transferable form, that can be realised on top of any pairing instantiation. As a bonus, we also derive from them a new, efficient identity-based signature scheme.
منابع مشابه
Efficient and Identity-based Signcryption with Provably-secure
The idea of signcryption is to provide a method to encrypt and sign data together, so it is more efficient than using an encryption scheme combined with a signature scheme. We present an identitybased signcryption solution, which is one of the most efficient, provably-secure schemes proposed to date. Our scheme admits provable security in the random oracle model under the bilinear DiffieHellman...
متن کاملSecure E-Tendering System using Identity Based Signcryption from Bilinear Pairings
An electronic tender system (e-tender) streamlines the tender process and thereby saves time and cost. Security requirements for e-tendering systems have not been closely scrutinized in the literature. In addition to the security concerns of conventional e-tender systems—authentication, integrity, privacy, and non-repudiation are provided. This paper identifies key issues to be addressed in the...
متن کاملEfficient and Provably Secure Multi-receiver Identity-Based Signcryption
In this paper, we propose an efficient multi-receiver identity based signcryption scheme which only needs one pairing computation to signcrypt a message for n receivers and can provide confidentiality and authenticity simultaneously in the multi-receiver setting. We compare our scheme with several multi-receiver constructions from the security and efficiency points of view and argue that our pr...
متن کاملOn the Security of ID Based Signcryption Schemes
A signcryption scheme is secure only if it satisfies both the confidentiality and the unforgeability properties. All the ID based signcryption schemes presented in the standard model till now do not have either the confidentiality or the unforgeability or both of these properties. Cryptanalysis of some of the schemes have been proposed already. In this work, we present the security attack on ‘S...
متن کاملEfficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
In this paper we describe a new identity-based signcryption (IBSC) scheme built upon bilinear maps. This scheme turns out to be more efficient than all others proposed so far. We prove its security in a formal model under recently studied computational assumptions and in the random oracle model. As a result of independent interest, we propose a new provably secure identity-based signature (IBS)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2004 شماره
صفحات -
تاریخ انتشار 2004